Polynomials for Proving Termination of Context-Sensitive Rewriting
ثبت نشده
چکیده
منابع مشابه
Polynomials for Proving Termination of Context-Sensitive Rewriting
We show how to generate well-founded and stable term orderings based on polynomial interpretations over the real numbers. Monotonicity (another usual requirement in termination proofs) can, then, be gradually introduced in the interpretations to deal with different applications. For instance, the dependency pairs method for proving termination of rewriting, and some restrictions of the rewrite ...
متن کاملAutomatic Proofs of Termination of Context-Sensitive Rewriting
The idea of an incremental application of different termination techniques asprocessors for solving termination problems has shown to be a powerful andefficient way to prove termination of rewriting. Nowadays, the dependencypair framework (which develops this idea) is the most successful approach forproving termination of rewriting. The dependency pair framework relies onthe...
متن کاملTermination of context-sensitive rewriting
Context-sensitive term rewriting is a kind of term rewriting in which reduction is not allowed inside some xed arguments of some function symbols. We introduce two new techniques for proving termination of context-sensitive rewriting. The rst one is a modi cation of the technique of interpretation in a well-founded order, the second one is implied by a transformation in which context-sensitive ...
متن کاملTermination of Context-Sensitive Rewriting
Context-sensitive term rewriting is a kind of term rewriting in which reduction is not allowed inside some xed arguments of some function symbols. We introduce two new techniques for proving termination of context-sensitive rewriting. The rst one is a modi cation of the technique of interpretation in a well-founded order, the second one is implied by a transformation in which context-sensitive ...
متن کاملUsing Context-Sensitive Rewriting for Proving Innermost Termination of Rewriting
Computational systems based on reducing expressions usually have a predefined reduction strategy to break down the nondeterminism which is inherent to reduction relations. The innermost strategy corresponds to call by value or eager computation, that is, the computational mechanism of several programming languages like Maude, OBJ, etc. where the arguments of a function call are always evaluated...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004